Jamming as a random first-order percolation transition
نویسندگان
چکیده
We determine the dimensional dependence of percolative exponents jamming transition via numerical simulations in four and five spatial dimensions. These novel results complement literature ones, establish as a mixed first-order percolation transition, with critical $\beta =0$, $\gamma = 2$, $\alpha 0$ finite size scaling exponent $\nu^* 2/d$ for values dimension $d \geq 2$. argue that upper is $d_u=2$ connectedness length $\nu =1$.
منابع مشابه
Renormalization group analysis of the random first-order transition.
We consider the approach describing glass formation in liquids as a progressive trapping in an exponentially large number of metastable states. To go beyond the mean-field setting, we provide a real-space renormalization group (RG) analysis of the associated replica free-energy functional. The present approximation yields in finite dimensions an ideal glass transition similar to that found in t...
متن کاملManifestation of random first-order transition theory in Wigner glasses.
We use Brownian dynamics simulations of a binary mixture of highly charged spherical colloidal particles to test some of the predictions of the random first-order transition (RFOT) theory [Phys. Rev. Lett. 58, 2091 (1987); Phys. Rev. A 40, 1045 (1989)]. In accord with mode-coupling theory and RFOT, we find that as the volume fraction of the colloidal particles ϕ approaches the dynamical transit...
متن کاملGranular collapse as a percolation transition.
Inelastic collapse is found in a two-dimensional system of inelastic hard disks confined between two walls which act as an energy source. As the coefficient of restitution is lowered, there is a transition between a state containing small collapsed clusters and a state dominated by a large collapsed cluster. The transition is analogous to that of a percolation transition. At the transition the ...
متن کاملFirst passage percolation on the random graph
We study first passage percolation on the random graph Gp(N) with exponentially distributed weights on the links. For the special case of the complete graph this problem can be described in terms of a continuous time Markov chain and recursive trees. The Markov chain X(t) describes the number of nodes that can be reached from the initial node in time t. The recursive trees, which are uniform tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica D: Nonlinear Phenomena
سال: 2021
ISSN: ['1872-8022', '0167-2789']
DOI: https://doi.org/10.1016/j.physa.2021.125796